Almost-Everywhere Complexity Hierarchies for Nondeterministic Time

نویسندگان

  • Eric Allender
  • Richard Beigel
  • Ulrich Hertrampf
  • Steven Homer
چکیده

A preliminary version of this work appeared as [2]. y Supported in part by National Science Foundation grant CCR-9000045. Some of this research was performed while the author was a visiting professor at Institut f ur Informatik, Universit at W urzburg, D-8700 W urzburg, Federal Republic of Germany. z Supported in part by the National Science Foundation grants CCR-8808949 and CCR-8958528. Work done in part while at the Johns Hopkins University. x Supported in part by National Science Foundation grants MIP-8608137 and CCR-8814339, National Security Agency grant MDA904-87-H, and a Fulbright-Hays research fellowship. Some of this research was performed while the author was a Guest Professor at Mathematisches Institut, Universit at Heidelberg.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hierarchies Against Sublinear Advice

We strengthen the non-deterministic time hierarchy theorem of [5,15,18] to show that the lower bound holds against sublinear advice. More formally, we show that for any constants c and d such that 1 6 c < d, there is a language in NTIME(n) which is not in NTIME(n)/n. The best known earlier separation [8] could only handle o(log(n)) bits of advice in the lower bound. We generalize our hierarchy ...

متن کامل

On the Hierarchies for Deterministic, Nondeterministic and Probabilistic Ordered Read-k-times Branching Programs

The paper examines hierarchies for nondeterministic and deterministic ordered read-k-times Branching programs. The currently known hierarchies for deterministic k-OBDD models of Branching programs for k = o(n1/2/ log n) are proved by B. Bollig, M. Sauerhoff, D. Sieling, and I. Wegener in 1998. Their lower bound technique was based on communication complexity approach. For nondeterministic k-OBD...

متن کامل

Some Results on Relativized Deterministic and Nondeterministic Time Hierarchies

Relativized forms of deterministic and nondeterministic time complexity classes are considered. It is shown, at variance with recently published observations, that one basic step by step simulation technique in complexity theory does not relativize (i.e., does not generalize to computations with oracles), using the current definitions for time and space complexity of oracle computations. A new ...

متن کامل

On Strong Separations from AC

1 SUMMARY As part of a study of almost-everywhere complex sets, we i n vestigate sets that are immune to AC 0 ; that is, sets with no innnite subset in AC 0. W e show that such sets exist in P PP and in DSPACElog n log n. Our main result is an oracle construction indicating that any improvement in these immunity results will represent a signiicant advance, in that we show that any answer to the...

متن کامل

Almost Everywhere High Nonuniform Complexity

We investigate the distribution of nonuniform complexities in uniform complexity classes We prove that almost every problem decidable in exponential space has essentially maximum circuit size and space bounded Kolmogorov complexity almost everywhere The circuit size lower bound actually exceeds and thereby strengthens the Shannon n n lower bound for almost every problem with no computability co...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Theor. Comput. Sci.

دوره 115  شماره 

صفحات  -

تاریخ انتشار 1993